Effective lattice point counting in rational convex polytopes
نویسندگان
چکیده
منابع مشابه
A Simple Algorithm for Lattice Point Counting in Rational Polygons
We propose a simple algorithm for lattice point counting in rational polygons. A rational polygon is one whose vertices have rational coordinates. The algorithm decomposes a given polygon into right trapezoids and counts the number of lattice points in the right trapezoids. Each right trapezoid can be dissected into a rectangle and a right-angled triangle in the obvious way. The number of latti...
متن کاملVolumes of Convex Lattice Polytopes
We show by a direct construction that there are at least exp{cV (d−1)/(d+1)} convex lattice polytopes in R of volume V that are different in the sense that none of them can be carried to an other one by a lattice preserving affine transformation. This is achieved by considering the family Pd(r) (to be defined in the text) of convex lattice polytopes whose volumes are between 0 and r/d!. Namely ...
متن کاملUniversal Counting of Lattice Points in Polytopes
Given a lattice polytope P (with underlying lattice L), the universal counting function UP (L ) = |P ∩ L| is defined on all lattices L containing L. Motivated by questions concerning lattice polytopes and the Ehrhart polynomial, we study the equation UP = UQ. Mathematics Subject Classification: 52B20, 52A27, 11P21 Partially supported by Hungarian Science Foundation Grant T 016391, and by the Fr...
متن کاملMinkowski sums of convex lattice polytopes
submitted at the Oberwolfach Conference “Combinatorial Convexity and Algebraic Geometry” 26.10–01.11, 1997 Throughout, we fix the notation M := Z and MR := R . Given convex lattice polytopes P, P ′ ⊂ MR, we have (M ∩ P ) + (M ∩ P ) ⊂ M ∩ (P + P ), where P + P ′ is the Minkowski sum of P and P , while the left hand side means {m+m | m ∈ M ∩ P,m ∈ M ∩ P }. Problem 1 For convex lattice polytopes P...
متن کامل2 00 6 Classification of Lattice - Regular Lattice Convex Polytopes
In this paper for any dimension n we give a complete list of lattice convex polytopes in R that are regular with respect to the group of affine transformations preserving the lattice.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2004
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2003.04.003